package org.leetcode.middle.leetcode583;

public class Solution2 {
    public int minDistance(String word1, String word2) {

        int n1 = word1.length();
        int n2 = word2.length();

        int[][] dp = new int[n1 + 1][n2 + 1];

        for (int i = 0; i <= n1; i++) {
            dp[i][0] = i;
        }

        for (int j = 0; j <= n2; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= n1; i++) {
            for (int j = 1; j <= n2; j++) {
                if (word1.charAt(i-1)==word2.charAt(j-1)){
                    dp[i][j]=dp[i-1][j-1];
                }else {
                    dp[i][j]=Math.min(dp[i-1][j],dp[i][j-1])+1;
                }
            }
        }
        return dp[n1][n2];
    }

    public int minDistance2(String word1, String word2){


        int n1 = word1.length();
        int n2 = word2.length();

        int [][] dp = new int[n1+1][n2+1];
        int maxCommonLength = 0;

        for (int i = 1; i <= n1 ; i++) {
            for (int j = 1; j <= n2 ; j++) {
                if (word1.charAt(i-1)==word2.charAt(j-1)){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else {
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }

                maxCommonLength=Math.max(maxCommonLength,dp[i][j]);
            }
        }


        return n1+n2-2*maxCommonLength;
    }
}
